Moreau Envelope Augmented Lagrangian Method for Nonconvex Optimization with Linear Constraints
نویسندگان
چکیده
The augmented Lagrangian method (ALM) is one of the most useful methods for constrained optimization. Its convergence has been well established under convexity assumptions or smoothness assumptions, both assumptions. ALM may experience oscillations and divergence when underlying problem simultaneously nonconvex nonsmooth. In this paper, we consider linearly with a (in particular, weakly convex) nonsmooth objective. We modify to use Moreau envelope establish its conditions that are weaker than those in literature. call it (MEAL) method. also show iteration complexity MEAL $$o(\varepsilon ^{-2})$$ yield an $$\varepsilon $$ -accurate first-order stationary point. whole sequence (regardless initial guess) rate Kurdyka–?ojasiewicz property assumed. Moreover, subproblem no closed-form solution difficult solve, propose two practical variants MEAL, inexact version called iMEAL approximate proximal update, linearized LiMEAL composite Their established.
منابع مشابه
An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization
This paper is about distributed derivative-based algorithms for solving optimization problems with a separable (potentially nonconvex) objective function and coupled affine constraints. A parallelizable method is proposed that combines ideas from the fields of sequential quadratic programming and augmented Lagrangian algorithms. The method negotiates shared dual variables that may be interprete...
متن کاملA Feasible Augmented Lagrangian Method for Non-lipschitz Nonconvex Programming
We consider a class of constrained optimization problems where the objective function is a sum of a smooth function and a nonconvex non-Lipschitz function. Many problems in sparse portfolio selection, edge preserving image restoration and signal processing can be modelled in this form. First we propose the concept of the Karush-Kuhn-Tucker (KKT) stationary condition for the non-Lipschitz proble...
متن کاملAn Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming
We consider a class of constrained optimization problems where the objective function is a sum of a smooth function and a nonconvex non-Lipschitz function. Many problems in sparse portfolio selection, edge preserving image restoration and signal processing can be modelled in this form. First we propose the concept of the Karush-Kuhn-Tucker (KKT) stationary condition for the non-Lipschitz proble...
متن کاملAn augmented Lagrangian method for distributed optimization
We propose a novel distributed method for convex optimization problems with a certain separability structure. The method is based on the augmented Lagrangian framework. We analyze its convergence and provide an application to two network models, as well as to a two-stage stochastic optimization problem. The proposed method compares favorably to two augmented Lagrangian decomposition methods kno...
متن کاملAugmented Lagrangian Duality and Nondifferentiable Optimization Methods in Nonconvex Programming
Abstract. In this paper we present augmented Lagrangians for nonconvex minimization problems with equality constraints. We construct a dual problem with respect to the presented here Lagrangian, give the saddle point optimality conditions and obtain strong duality results. We use these results and modify the subgradient and cutting plane methods for solving the dual problem constructed. Algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2022
ISSN: ['1573-7691', '0885-7474']
DOI: https://doi.org/10.1007/s10915-022-01815-w